Power classes of search directions and dualistic structure on symmetric cones
نویسنده
چکیده
Our original results refer to dualistic structure on primaldual interior-point methods for symmetric cone programs with linear constraints. It is shown that scalings by the Nesterov-Todd direction are generated by middle points of geodesics joining with primal interior points and dual interior points. Finally we relate power classes of search directions with geodesics and weighted geometric means. M.S.C. 2010: 17C36, 53A15, 90C51.
منابع مشابه
A full NT-step O(n) infeasible interior-point method for Cartesian P_*(k) –HLCP over symmetric cones using exponential convexity
In this paper, by using the exponential convexity property of a barrier function, we propose an infeasible interior-point method for Cartesian P_*(k) horizontal linear complementarity problem over symmetric cones. The method uses Nesterov and Todd full steps, and we prove that the proposed algorithm is well define. The iteration bound coincides with the currently best iteration bound for the Ca...
متن کاملOn Commutative Class of Search Directions for Linear Programming over Symmetric Cones
The Commutative Class of search directions for semidefinite programming is first proposed by Monteiro and Zhang [13]. In this paper, we investigate the corresponding class of search directions for linear programming over symmetric cones, which is a class of convex optimization problems including linear programming, second-order cone programming, and semidefinite programming as special cases. Co...
متن کاملAn interior-point method for the Cartesian P∗(κ)-linear complementarity problem over symmetric cones
A novel primal-dual path-following interior-point algorithm for the Cartesian P∗(κ)-linear complementarity problem over symmetric cones is presented. The algorithm is based on a reformulation of the central path for finding the search directions. For a full Nesterov-Todd step feasible interior-point algorithm based on the new search directions, the complexity bound of the algorithm with small-u...
متن کاملPolynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
We establish polynomial-time convergence of infeasible-interior-point methods for conic programs over symmetric cones using a wide neighborhood of the central path. The convergence is shown for a commutative family of search directions used in Schmieta and Alizadeh [9]. These conic programs include linear and semidefinite programs. This extends the work of Rangarajan and Todd [8], which establi...
متن کاملAssociative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
We present a general framework whereby analysis of interior-point algorithms for semidefinite programming can be extended verbatim to optimization problems over all classes of symmetric cones derivable from associative algebras. In particular, such analyses are extendible to the cone of positive semidefinite Hermitian matrices with complex and quaternion entries, and to the Lorentz cone. We pro...
متن کامل